Priestley Configurations and Heyting Varieties
نویسنده
چکیده
We investigate Heyting varieties determined by prohibition of systems of configuraations in Priestley duals; we characterize the configuration systems yielding such varieties. On the other hand, the question whether a given finitely generated Heyting variety is obtainable by such means is solved for the special case of systems of trees. Priestley duality provides a correspondence between bounded distributive lattices and certain ordered topological spaces. (See [11] and [12], and for an elementary exposition [4].) In a previous article [2] we showed, among other things, that the class of all Heyting algebras whose Priestley spaces contain no copy of a given single (finite) configuration formed a variety iff the configuration was a tree. Consequently, prohibiting any system of trees presents a Heyting variety as well. But if a system of prohibited configurations has more than one element, it need not consist of trees alone, or be replaceable by such, to yield a variety. One of our two main results characterizes just such configuration systems. Our other major result addresses the opposite question: given a variety, when can it be obtained by prohibiting a system of trees? (The general question of when a variety results from the prohibition of any system of configurations is beyond the scope of this article.) We present a complete characterization for the case of finitely generated varieties; special consideration is given to varieties generated by a single object. There are two topics that we needed to discuss in some detail, in our context for more or less technical purposes, but these subjects may be of some interest in their own right. One of them is the nature of the Priestley equivalents of Heyting homomorphisms, and the other is The second author would like to express his thanks for the support by the project LN 00A056 of the Ministry of Education of the Czech Republic, by the NSERC of Canada and by the Gudder Trust of the University of Denver. The third author would like to express his thanks for the support by the NSERC of Canada and a partial support by the project LN 00A056 of the Ministry of Education of the Czech Republic. 1 2 RICHARD N. BALL, ALEŠ PULTR, AND JIŘÍ SICHLER the order structure of coproducts of Priestley spaces, a topic which in general seems to be far from fully understood. To each of these we devote a special section.
منابع مشابه
Optimal natural dualities for varieties of Heyting algebras
The techniques of natural duality theory are applied to certain finitely generated varieties of Heyting algebras to obtain optimal dualities for these varieties, and thereby to address algebraic questions about them. In particular, a complete characterisation is given of the endodualisable finite subdirectly irreducible Heyting algebras. The procedures involved rely heavily on Priestley duality...
متن کاملDualities in Lattice Theory
In this note we prove several duality theorems in lattice theory. We also discuss the connection between spectral spaces and Priestley spaces, and interpret Priestley duality in terms of spectral spaces. The organization of this note is as follows. In the first section we collect appropriate definitions and basic results common to many of the various topics. The next four sections consider Birk...
متن کاملMartin Frontal operators in weak Heyting algebras
In this paper we shall introduce the variety FWHA of frontal weak Heyting algebras as a generalization of the frontal Heyting algebras introduced by Leo Esakia in [10]. A frontal operator in a weak Heyting algebra A is an expansive operator τ preserving finite meets which also satisfies the equation τ(a) ≤ b ∨ (b → a), for all a, b ∈ A. These operators were studied from an algebraic, logical an...
متن کاملConfigurations in Coproducts of Priestley Spaces
Let P be a configuration, i.e., a finite poset with top element. Let Forb(P ) be the class of bounded distributive lattices L whose Priestley space P(L) contains no copy of P . We show that the following are equivalent: Forb(P ) is first-order definable, i.e., there is a set of first-order sentences in the language of bounded lattice theory whose satisfaction characterizes membership in Forb(P ...
متن کاملForbidden Forests in Priestley Spaces
We present a first order formula characterizing the distributive lattices L whose Priestley spaces P(L) contain no copy of a finite forest T . For Heyting algebras L, prohibiting a finite poset T in P(L) is characterized by equations iff T is a tree. We also give a condition characterizing the distributive lattices whose Priestley spaces contain no copy of a finite forest with a single addition...
متن کامل